Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
111	Geoinformatica DOIs10707Task selection in spatial crowdsourcing from worker’s perspective Dingxiong Deng1 · Cyrus Shahabi1 · Add to Reading List Source URL: infolab.usc.edu Language: English - Date: 2016-05-21 03:16:43 Mathematics Graph theory Operations research Computational complexity theory Combinatorial optimization Mathematical optimization Travelling salesman problem Dynamic programming Algorithm Approximation algorithm Heterogeneous Earliest Finish Time Assignment problem
112	On-line Maximum Matching in Complete Multipartite Graphs with Implications to the Minimum ADM Problem on a Star Topology Mordechai Shalom1 ? , Prudence W.H. Wong ??2 Add to Reading List Source URL: cgi.csc.liv.ac.uk Language: English - Date: 2009-06-10 05:42:48 Graph theory Mathematics Computational complexity theory Combinatorial optimization Routing algorithms Search algorithms Matching Randomized algorithm A* search algorithm Bipartite graph HopcroftKarp algorithm Threaded binary tree
113	CS264: Beyond Worst-Case Analysis Lecture #15: Smoothed Complexity and Pseudopolynomial-Time Algorithms∗ Tim Roughgarden† November 5, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-12-24 22:57:16 Computational complexity theory Theory of computation Operations research Complexity classes Combinatorial optimization Analysis of algorithms Knapsack problem Simplex algorithm Time complexity Optimization problem NP Polynomial-time approximation scheme
114	Budgeted Coverage of a Maximum Part of a Polygonal Area Euripides Markou1 , Stathis Zachos1,2 and Christodoulos Fragoudakis1 1 Computer Science, ECE, National Technical University of Athens Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:43 Mathematics Geometry Graph theory Polygons Computational geometry Euclidean plane geometry Art gallery problem Vertex Visibility graph Visibility polygon Pseudotriangle
115	CS261: A Second Course in Algorithms Lecture #13: Online Scheduling and Online Steiner Tree∗ Tim Roughgarden† February 16, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-03-01 15:15:38 Graph theory Mathematics Computational complexity theory NP-complete problems Spanning tree Operations research Combinatorial optimization NP-hard problems Online algorithm Steiner tree problem Minimum spanning tree Travelling salesman problem
116	COMPLEXITY AND APPROXIMABILITY OF THE COVER POLYNOMIAL ¨ser, Holger Dell, and Mahmoud Fouz Markus Bla Abstract. The cover polynomial and its geometric version introduced by Chung & Graham and D’Antona & Munarini, res Add to Reading List Source URL: www-cc.cs.uni-saarland.de Language: English - Date: 2014-01-17 04:55:28 Mathematics Computational complexity theory Graph theory Polynomials Complexity classes Computational problems Mathematical optimization Tutte polynomial Chromatic polynomial Optimization problem NP Matroid
117	The complexity of positive first-order logic without equality∗ Florent Madelaine Univ Clermont1, EA2146, Laboratoire d’algorithmique et d’image de Clermont-Ferrand, Aubi`ere, F-63170, France. fmadelaine@laic.u-cler Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:55:46 Complexity classes Structural complexity theory FO Finite model theory Computational complexity theory IP Homomorphism NP Reduction Symbol P versus NP problem Model theory
118	The competition Series in the NoE EUNITE 2001 toIntroduction The following summary is not intended to describe the contents of competitions within the Add to Reading List Source URL: www.eunite.org Language: English - Date: 2014-12-11 06:04:47 Scientific method Artificial neural network Computational neuroscience Mathematical psychology Problem solving Algorithm Research Prediction Competitive programming
119	POS Tagging Problem •  Given a sentence W1…Wn and a tagset of lexical categories, find the most likely tag T1..Tn for each word in the sentence •  Example Secretariat/NNP is/VBZ expected/VBN to/TO race/VB tomor Add to Reading List Source URL: cl.indiana.edu Language: English - Date: 2016-02-17 11:43:10 Markov models Computational linguistics Brown Corpus Brown University Natural language processing Part-of-speech tagging N-rule PRNP Word-sense disambiguation
120	BRICS Basic Research in Computer Science BRICS NS-00-1 B. G¨artner: Randomization and Abstraction — Useful Tools for Optimization Add to Reading List Source URL: people.inf.ethz.ch Language: English - Date: 2016-06-20 11:55:09 Operations research Foreign relations of Brazil Foreign relations of India Computational geometry Linear programming LP-type problem Emo Welzl Mathematical optimization Bounding sphere BRIC Randomization

UPDATE